Banach空间中拟非扩展映象的不动点的迭代逼近

研究了严格凸Banach空间中非空间凸子集上拟非扩展映象的不动点的迭代逼近问题,主要证明了:设E是严格凸Banach空间,K为E的闭凸子集,T:K→K为连续拟非扩展映象。进一步假设T(K)包含于K的一个紧子集之中,迭代地定义序列{xn}∞n=1如下:(IS)yn=(1-βn)xn+βnTxn,n≥1,xn+1=(1-αn)xn+αnTyn,n≥1,其中{αn}和{βn}满足一定的条件,则{xn}强收敛于T的某个不动点。     

采用重组模板的权重优化WENO-Z格式

针对精确模拟含激波等复杂流动结构的流场对高精度格式的低耗散低色散要求,基于5阶有限差分WENO-Z格式,提出一种模板重组技术。在计算WENO非线性权时,引入一个由3点模板重新组合的4点模板,优化原格式中各模板的权重分配,进而提出了两种改进WENO-Z格式。采用近似色散关系分析方法对改进前后格式色散与耗散特性进行了对比与分析。分析表明：两种改进格式耗散有不同程度的降低。数值实验表明:改进格式具有更优越的激波捕捉性能,对小尺度流场结构具有更高的分辨率。     

Single machine scheduling with a restricted rate‐modifying activity

In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

二维超声速混合层的大涡模拟

对二维超声速混合层流动进行大涡模拟。采用五阶精度的WENO格式求解大尺度涡的控制方程,小尺度涡的作用采用Smagorinsky亚格子模型进行模拟。模拟结果再现了二维超声速混合层拟序结构,计算得到了涡组对、合并等现象。通过对流场不同位置压力振荡历程的频谱分析,对超声速混合层中的谐波变化规律作了初步探讨。计算得到的速度剖面的时均统计结果与实验结果相比,吻合程度较好。     

编队协同反导决策方案优选

为了充分地调度好编队全部的抗导资源,实现抗导弹群的成功概率最大,在利用随机服务系统理论对编队协同反导决策方案各指标值进行计算的基础上,将"模糊优选理论"与"协同学原理"有机地结合起来,求解了在反舰导弹到达强度与舰空导弹的单发杀伤概率在不同值的情况下,编队协同反导决策方案的隶属度,为编队指挥员进行反导决策方案的优选提供了科学依据。     

基于熵权灰关联法的基地防空作战方案优选

海军基地防空作战方案优选问题是海军基地防空作战指挥决策的重要内容,其实质是一个多目标(指标)决策问题。尝试将熵值理论与灰色关联分析法结合,建立基于熵权的灰色关联分析模型,有效地解决了权重分配偏差问题,并在分析作战指标的基础上对待选方案进行加权关联度排序,从而得到总体方案最优排序结果。     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001     

Minimizing sums and products of linear fractional functions over a polytope

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999     

三维涡度方程单向周期问题的谱—差分混合格式及其误差估计

本文对非线性的三维涡度方程单向周期问题构造了一种新的谱——差分格式,并证明了格式的稳定性和收敛性。     

基于节点选择更新的简化LDPC译码算法

文中通过分析信息在短环中传递的特性,提出了一种基于节点选择更新的简化LDPC译码算法。该算法可以通过在一定程度上避免短环对译码的影响来降低译码运算复杂度。仿真结果表明对于二元以及多元LDPC码,该算法相对于BP算法只有少量性能损失。